Embedded Voxel Colouring

نویسندگان

  • Carlos Leung
  • Ben Appleton
  • Changming Sun
چکیده

The reconstruction of a complex scene from multiple images is a fundamental problem in the field of computer vision. Volumetric methods have proven to be a strong alternative to traditional correspondence-based methods due to their flexible visibility models. In this paper we analyse existing methods for volumetric reconstruction and identify three key properties of voxel colouring algorithms: a water-tight surface model, a monotonic carving order, and causality. We present a new Voxel Colouring algorithm which embeds all reconstructions of a scene into a single output. While modelling exact visibility for arbitrary camera locations, Embedded Voxel Colouring removes the need for a priori threshold selection present in previous work. An efficient implementation is given along with results demonstrating the advantages of posteriori threshold selection.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ray casting for incremental voxel colouring

Image based volumetric reconstruction from multiple views is an interesting challenge. Recently several methods of optimisation–based voxel colouring have appeared, which make use of incremental visibility. Culbertson et al. presented a way of determining visibility incrementally by using layered depth images as a data structure (GVC-LDI). We present an alternative algorithm which provides the ...

متن کامل

Integration of Voxel Colouring Technique in the Volumetric Textures Representation Based on Image Layers Babahenini

This paper presents a method for integrating a technique of reconstruction scene (voxel colouring) starting from images of the reference element of a volumetric texture, this one will be converted in a second phase into a whole of layers (2D images considered as transparent textures), which will be projected and composed successively on surface defined as volumetric grid using the Zbuffer algor...

متن کامل

COMPLETING AN EDGE-COLOURING OF K2m WITH Kr AND INDEPENDENT EDGES PRECOLOURED

Those (2m−1)-edge-colourings of a spanning subgraph of K2m , consisting of Kr and independent edges, that can be embedded in a (2m− 1)-edge-colouring of K2m are characterised.

متن کامل

Modelling and FPGA-based Implementation of Graph Colouring Algorithms

The paper discusses an effective matrix-based exact algorithm for graph colouring that is well-suited for implementation in FPGA. It is shown that the algorithm can also be used as a base for a number of approximate algorithms. Software models (described in C++) and hardware circuits (synthesised from Handel-C specifications) for the exact algorithm are discussed, analysed and compared. Charact...

متن کامل

Colouring 4 - cycle systems with specified block colour patterns : the case of embedding P 3 - designs ∗ Gaetano

A colouring of a 4-cycle system (V,B) is a surjective mapping φ : V → Γ. The elements of Γ are colours. If |Γ| = m, we have an m-colouring of (V,B). For every B ∈ B, let φ(B) = {φ(x)|x ∈ B}. There are seven distinct colouring patterns in which a 4-cycle can be coloured: type a (××××, monochromatic), type b (×××2, two-coloured of pattern 3 + 1), type c (× × 22, two-coloured of pattern 2 + 2), ty...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003